Sparse signal recovery from modulo observations
نویسندگان
چکیده
Abstract We consider the problem of reconstructing a signal from under-determined modulo observations (or measurements). This observation model is inspired by relatively new imaging mechanism called imaging, which can be used to extend dynamic range systems; variations this have also been studied under category phase unwrapping. Signal reconstruction in regime with challenging ill-posed problem, and existing methods cannot directly. In paper, we propose novel approach solving recovery sparsity constraints for special case folding limited two periods. show that given sufficient number measurements, our algorithm perfectly recovers underlying signal. provide experiments validating on toy image data demonstrate its promising performance.
منابع مشابه
Sparse Signal Recovery from Nonadaptive Linear Measurements
The theory of Compressed Sensing , the emerging sampling paradigm ‘that goes against the common wisdom’ , asserts that ‘one can recover signals in R from far fewer samples or measurements , if the signal has a sparse representation in some orthonormal basis, from m ≈ O(klogn), k ≪ n nonadaptive measurements . The accuracy of the recovered signal is as good as that attainable with direct knowled...
متن کاملSparse signal recovery using sparse random projections
Sparse signal recovery using sparse random projections
متن کاملSparse signal recovery with unknown signal sparsity
In this paper, we proposed a detection-based orthogonal match pursuit (DOMP) algorithm for compressive sensing. Unlike the conventional greedy algorithm, our proposed algorithm does not rely on the priori knowledge of the signal sparsity, which may not be known for some application, e.g., sparse multipath channel estimation. The DOMP runs binary hypothesis on the residual vector of OMP at each ...
متن کاملNote on sparse signal recovery
Definition 1 (Restricted isometry and orthogonality). The S-restricted isometry constant δS of a matrix F ∈ Rn×m is the smallest quantity such that (1− δS)‖x‖2 ≤ ‖FTx‖2 ≤ (1 + δS)‖x‖2 for all T ⊆ [m] with |T | ≤ S and all x ∈ R|T |. The (S, S′)-restricted orthogonality constant θS,S′ of F is the smallest quantity such that |FTx · FT ′x′| ≤ θS,S′‖c‖‖c‖ for all disjoint T, T ′ ⊆ [m] with |T | ≤ S...
متن کاملFast GPU Implementation of Sparse Signal Recovery from Random Projections
We consider the problem of sparse signal recovery from a small number of random projections (measurements). This is a well known NP-hard to solve combinatorial optimization problem. A frequently used approach is based on greedy iterative procedures, such as the Matching Pursuit (MP) algorithm. Here, we discuss a fast GPU implementation of the MP algorithm, based on the recently released NVIDIA ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Advances in Signal Processing
سال: 2021
ISSN: ['1687-6180', '1687-6172']
DOI: https://doi.org/10.1186/s13634-021-00722-w